| 1. | A line image displayed to connect adjacent nodes
I . gif连接相邻节点所显示的线条图像。 |
| 2. | Given this option , if you have two adjacent nodes call them
根据这种机制，若想交换两个相邻节点（称为 |
| 3. | In a network , a path that connects two adjacent nodes and that has no intermediate nodes
网络中两个无中间节点的相邻网点间的一条直接通路。 |
| 4. | Specifies the amount of vertical spacing between the entire current node and adjacent nodes above and below
指定整个当前节点与上下相邻的节点之间的垂直间距。 |
| 5. | The logical distance between two nodes . one hop is the distance from one node to an adjacent node
两个节点间的逻辑距离,即一个跃距为从一个节点到邻近一个节点的距离。 |
| 6. | The models to calculate the whole cooperation intensity and that between enterprises of adjacent nodes in a supply chain were presented
在此基础上构建了供应链相邻节点企业之间和企业整体合作强度的计算模型。 |
| 7. | With the path - based searching techniques , searching tasks originally for a node can be distributed to multiple adjacent nodes , so as to speed up the searching process
当改为基于通路搜索后，原来汇聚到一个节点的处理，分散到多个相邻节点进行并行处理，有效地加快了配置速度。 |
| 8. | The connecting states of nodes are uncertain and the linking relation between two adjacent nodes is unperceptible in advance , so this unperceptivity can be mapped to xor function ; when forming the access of flow , not all nodes can become the node on the access . to a certain degree , the form of access embodies intelligence of human , this ability of choice can be mapped to logistic function
网流空间中各个节点的连接状态是不确定的，节点与节点间的连接关系预先不可感知，这种不可知性可以映象为异或函数；节点在形成流的通路时，并不是所有节点都可以成为通路上的点，流质通路的形成在一定程度上体现了人的“智能性” ，这种选择能力用逻辑函数来映象。 |
